Classifying Loops for Space-Time Mapping
نویسندگان
چکیده
We propose a class hierarchy for loops in a loop nest. Its purpose is to help identify the proper code generation methods for a space-time mapped nest. We illustrate the hierarchy and its use on a loop nest for computing the reeexive transitive closure of a graph.
منابع مشابه
The compression theorem
The compression theorem solves a 20 year old problem [2; problem 6]. Applications include short new proofs for immersion theory and for the loops– suspension theorem of James et al and a new approach to classifying embeddings of manifolds in codimension one or more, which leads to theoretical solutions. The proof introduces a novel technique in differential topology: proof by dynamical systems....
متن کاملDouble Sequence Iterations for Strongly Contractive Mapping in Modular Space
In this paper, we consider double sequence iteration processes for strongly $rho$-contractive mapping in modular space. It is proved, these sequences, convergence strongly to a fixed point of the strongly $rho$-contractive mapping.
متن کاملIterative Process for an α- Nonexpansive Mapping and a Mapping Satisfying Condition(C) in a Convex Metric Space
We construct one-step iterative process for an α- nonexpansive mapping and a mapping satisfying condition (C) in the framework of a convex metric space. We study △-convergence and strong convergence of the iterative process to the common fixed point of the mappings. Our results are new and are valid in hyperbolic spaces, CAT(0) spaces, Banach spaces and Hilbert spaces, simultaneously.
متن کاملBP-cohomology of mapping spaces from the classifying space of a torus
Let p be a fixed prime number, V a group isomorphic to (Z/p) for some integer d and BV its classifying space. The exceptional properties of the mod p cohomology of BV , as an unstable module and algebra over the Steenrod algebra, have led to the calculation of the mod p cohomology of the mapping spaces with source BV as the image by a functor TV of the mod p cohomology of the target ([La2]). Th...
متن کاملThe Loop Parallelizer LooPo
We report on a prototype for testing diierent methods of space-time mapping loop nests. LooPo admits perfect or imperfect loop nests in a number of imperative languages, takes data dependences from the user or derives them itself from the source code, provides a choice of strategies for scheduling and allocating the loop nest's iterations, and produces synchronous or asynchronous parallel targe...
متن کامل